A generalization of heterochromatic graphs

نویسنده

  • Kazuhiro Suzuki
چکیده

In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. In this paper, we propose f -chromatic graphs as a generalization of heterochromatic graphs. An edge-colored graph is f -chromatic if each color c appears on at most f(c) edges. We also present a necessary and sufficient condition for edge-colored graphs to have an f -chromatic spanning forest with exactly m components. Moreover, using this criterion, we show that a g-chromatic graph G of order n with |E(G)| > ( n−m 2 ) has an f -chromatic spanning forest with exactly m (1 ≤ m ≤ n − 1) components if g(c) ≤ |E(G)| n−m f(c) for any color c. Keyword(s): f -chromatic, heterochromatic, rainbow, multicolored, totally multicolored, polychromatic, colorful, edge-coloring, k-bounded coloring, spanning tree, spanning forest. MSC2010: 05C05, 05C15.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalization of zero-divisor graphs

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores

متن کامل

A generalization of Villarreal's result for unmixed tripartite graphs

‎In this paper we give a characterization of unmixed tripartite‎ ‎graphs under certain conditions which is a generalization of a‎ ‎result of Villarreal on bipartite graphs‎. ‎For bipartite graphs two‎ ‎different characterizations were given by Ravindra and Villarreal‎. ‎We show that these two characterizations imply each other‎.

متن کامل

Graph product of generalized Cayley graphs over polygroups

 In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

متن کامل

Long heterochromatic paths in heterochromatic triangle free graphs ∗

In this paper, graphs under consideration are always edge-colored. We consider long heterochromatic paths in heterochromatic triangle free graphs. Two kinds of such graphs are considered, one is complete graphs with Gallai colorings, i.e., heterochromatic triangle free complete graphs; the other is heterochromatic triangle free graphs with k-good colorings, i.e., minimum color degree at least k...

متن کامل

Unmixed $r$-partite graphs

‎Unmixed bipartite graphs have been characterized by Ravindra and‎ ‎Villarreal independently‎. ‎Our aim in this paper is to‎ ‎characterize unmixed $r$-partite graphs under a certain condition‎, ‎which is a generalization of Villarreal's theorem on bipartite‎ ‎graphs‎. ‎Also, we give some examples and counterexamples in relevance to this subject‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1102.4802  شماره 

صفحات  -

تاریخ انتشار 2011